Execution times∗and execution jitter analysis of real-time tasks under fixed-priority pre-emptive scheduling
نویسندگان
چکیده
In this paper, we present worst-case and best-case execution times and (absolute) execution jitter analysis of independent, periodically activated, hard real-time tasks that are executed on a single processor under fixed-priority pre-emptive scheduling (FPPS), arbitrary phasing, (absolute) activation jitter, and deadlines at most equal to (worst-case) periods minus activation jitter. We prove that the worst-case and best-case execution time of a task are equal to its worst-case and best-case response time, respectively. We present an upper bound for execution jitter of a task expressed in terms of its best-case and worst-case execution time. We briefly consider execution times and execution jitter in other settings, such as distributed multiprocessor systems with task dependencies, tasks with arbitrary deadlines, and tasks with multiple operating modes. Execution jitter analysis is particularly valuable for real-time control systems to determine the variations in sampling-actuation delays of control tasks.
منابع مشابه
Scheduling slack time in fixed priority pre-emptive systems
This report addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or sporadic tasks, without jeopardising their timing constraints. It extends to tasks with characteri...
متن کاملTowards Exploiting the Preservation Strategy of Deferrable Servers
Worst-case response time analysis of hard real-time tasks under hierarchical fixed priority pre-emptive scheduling (H-FPPS) has been addressed in a number of papers. Based on an exact schedulability condition, we showed in [4] that the existing analysis can be improved for H-FPPS when deferrable servers are used. In this paper, we reconsider response time analysis and show that improvements are...
متن کاملExact Analysis of Adaptive Variable-Rate Tasks under Fixed-Priority Scheduling
Engine control applications require the execution of tasks activated in relation to specific system variables, as the crankshaft rotation angle. To prevent possible overload conditions at high rotation speeds, such tasks are designed to vary their functionality (hence their computational requirements) for different speed ranges. Modeling and analyzing such a type of tasks poses new research cha...
متن کاملFixed priority scheduling periodic tasks with varying execution priority
This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...
متن کاملExact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines
In this paper, we present a conjecture for exact best-case response times of periodic released, independent real-time tasks with arbitrary deadlines that are scheduled by means of fixed-priority pre-emptive scheduling (FPPS). We illustrate the analysis by means of an example. Apart from having a value on its own whenever timing constraints include lower bounds on response times of a system to e...
متن کامل